Real Analysis in Computer Science: A collection of Open Problems
نویسندگان
چکیده
We list a collection of open problems in real analysis in computer science, which complements, updates and extends a previous list curated by Ryan O’Donnell (2012). The object of study in these problems are boolean functions f : {0, 1} → {0, 1}, and their analytic and combinatorial properties. Many of the questions originate from in theoretical computer science or the theory of voting. The formulation of many of the questions has a strong combinatorial and analytical flavor including the use of the discrete Fourier expansion.
منابع مشابه
A Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملRobust high-dimensional semiparametric regression using optimized differencing method applied to the vitamin B2 production data
Background and purpose: By evolving science, knowledge, and technology, we deal with high-dimensional data in which the number of predictors may considerably exceed the sample size. The main problems with high-dimensional data are the estimation of the coefficients and interpretation. For high-dimension problems, classical methods are not reliable because of a large number of predictor variable...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملThe Challenges and Trends of Deploying Blockchain in the Real World for the Users’ Need
Blockchain technology is a decentralized and open database maintained by a peer-to-peer network, offering a “trustless trust” for untrusted parties. Despite the fact that some researchers consider blockchain as a bubble, blockchain technology has the genuine potential to solve problems across industries. In this article, we provide an overview of the development that Blockchain technology has h...
متن کامل